ENGPAESSE, STAUSTELLEN UND GLATTE HOMOGENE STROEME IN NETZEN = GOULOTS D'ETRANGLEMENT, POINTS D'ENGORGEMENT ET FLOTS HOMOGENES LISSES DANS LES RESEAUXSTECKHAN H.1978; Z. OPER. RES.; DEU; DA. 1978; VOL. 22; NO 5; PP. 199-217; ABS. ENG; BIBL. 2 P.Article

MINIMALE PFADE UND MINIMALE SCHNITTE BEI ZUVERLAESSIGKEITSUNTERSUCHUNGEN = CHEMINS MINIMAUX ET COUPES MINIMALES DANS DES ETUDES DE FIABILITESCHNEEWEISS W.1980; RT, REGELUNGSTECH.; ISSN 0340-434X; DEU; DA. 1980; VOL. 28; NO 9; PP. 289-293; ABS. ENG; BIBL. 5 REF.Article

RESIN, A DESKTOP-COMPUTER PROGRAM FOR FINDING CUT SETSMAGEE D; REFSUM A.1981; IEEE TRANS. RELIAB.; ISSN 0018-9529; USA; DA. 1981; VOL. 30; NO 5; PP. 407-410; BIBL. 4 REF.Article

DECOMPOSITION ALGORITHMS FOR LOCATING MINIMAL CUTS IN A NETWORKJARVIS JJ; TUFEKCI S.1982; MATH. PROGRAM.; ISSN 0025-5610; NLD; DA. 1982; VOL. 22; NO 3; PP. 316-331; BIBL. 22 REF.Article

A GENERALIZATION OF MAX FLOW-MIN CUT.HOFFMAN AJ.1974; MATH. PROGRAMMG; NETHERL.; DA. 1974; VOL. 6; NO 3; PP. 352-359; BIBL. 3 REF.Article

Sûreté de fonctionnement: terminologie et définitions = Operation safety: terms and definitionsBENSKI, C.Revue générale de l'électricité (Paris). 1992, Num 8, pp 5-9, issn 0035-3116Article

Ramsey partitions of integers and fair divisionsMCAVANEY, K; ROBERTSON, J; WEBB, W et al.Combinatorica (Print). 1992, Vol 12, Num 2, pp 193-201, issn 0209-9683Article

A top down approach to fault tree analysis using Binary Decision DiagramsCONTINI, S; DE COLA, G.Journal européen des systèmes automatisés. 1996, Vol 30, Num 8, pp 1115-1130, issn 1269-6935Article

An algorithm for reducing cut sets in fault-tree analysisLIMNIOS, N; ZIANI, R.IEEE transactions on reliability. 1986, Vol 35, Num 5, pp 559-562, issn 0018-9529Article

A method for evaluating all the minimal cuts of a graphJASMON, G. B; FOONG, K. W.IEEE transactions on reliability. 1987, Vol 36, Num 5, pp 539-545, issn 0018-9529Article

Minimal cuts up to third order in a planar graphVILAR, J.IEEE transactions on reliability. 1984, Vol 33, Num 3, pp 250-256, issn 0018-9529Article

SELECTED APPLICATIONS OF MINIMUM CUTS IN NETWORKSPICARD JC; QUEYRANNE M.1982; INFOR (OTTAWA); ISSN 0315-5986; CAN; DA. 1982; VOL. 20; NO 4; PP. 394-422; ABS. FRE; BIBL. 126 REF.Article

MOEGLICHKEITEN DER TRANSFORMATION EINES VERKEHRSNETZES IN EIN DAZU DUALES NETZ ZUM ZWECKE VON KAPAZITAETSUNTERSUCHUGEN = POSSIBILITES DE TRANSFORMATION D'UN RESEAU DE TRAFIC EN SON DUAL POUR UNE ANALYSE DE CAPACITEDOMSCHKE W; ENGELE G.1978; ANGEW. INFORMAT.; DEU; DA. 1978; NO 10; PP. 432-437; ABS. ENG; BIBL. 10 REF.Article

ON THE STRUCTURE OF ALL MINIMUM CUTS IN A NETWORK AND APPLICATIONSPICARD JC; QUEYRANNE M.1980; MATH. PROGRAM. STUDY; ISSN 0303-3929; NLD; DA. 1980; NO 13; PP. 8-16; BIBL. 28 REF.Article

ODD MINIMUM CUT-SETS AND B-MATCHINGS = ENSEMBLES DE COUPURE MINIMAUX IMPAIRS ET B-COUPLAGESPADBERG MW; RAO MR.1982; MATH. OPER. RES.; ISSN 0364-765X; USA; DA. 1982; VOL. 7; NO 1; PP. 67-80; BIBL. 18 REF.Article

DECOMPOSITION ALGORITHMS FOR MINIMAL CUT PROBLEMS = ALGORITHMES DE DECOMPOSITION POUR LES PROBLEMES DE COUPURE MINIMALETUFEKCI S.1981; NAV. RES. LOGIST. Q.; ISSN 0028-1441; USA; DA. 1981; VOL. 28; NO 3; PP. 431-445; BIBL. 22 REF.Article

A symbolic reliability of multiple path required system with three statesCHOI, I.-K; KOH, J.-S; LEE, S.-Y et al.Microelectronics and reliability. 1997, Vol 37, Num 3, pp 429-435, issn 0026-2714Article

Minimum cuts, modular functions, and matroid polyhedraCUNNINGHAM, W. H.Networks (New York, NY). 1985, Vol 15, Num 2, pp 205-215, issn 0028-3045Article

On the angular resolution of planar graphsMALITZ, S; PAPAKOSTAS, A.SIAM journal on discrete mathematics (Print). 1994, Vol 7, Num 2, pp 172-183, issn 0895-4801Article

The equivalent subgraph and directed cut polyhedra on series-parallel graphsSUNIL CHOPRA.SIAM journal on discrete mathematics (Print). 1992, Vol 5, Num 4, pp 475-490, issn 0895-4801Article

On finding critical independent and vertex setsAGEEV, A. A.SIAM journal on discrete mathematics (Print). 1994, Vol 7, Num 2, pp 293-295, issn 0895-4801Article

The poset scheduling problemCHANG, G. J; EDMONDS, J.Order (Dordrecht). 1985, Vol 2, Num 2, pp 113-118, issn 0167-8094Article

An improved algorithm for the planar 3-cut problemXIN HE.Journal of algorithms (Print). 1991, Vol 12, Num 1, pp 23-37, issn 0196-6774Article

The density of a maximum minimal cut in the subset lattice of a finite set is almost oneFENG SHI; WEIXUAN LI.Discrete mathematics. 1993, Vol 123, Num 1-3, pp 111-115, issn 0012-365XArticle

Network reinforcementBARAHONA, Francisco.Mathematical programming. 2006, Vol 105, Num 2-3, pp 181-200, issn 0025-5610, 20 p.Article